Real-time topological image smoothing on shared memory parallel machines
نویسندگان
چکیده
Smoothing filter is the method of choice for image preprocessing and pattern recognition. We present a new concurrent method for smoothing 2D object in binary case. Proposed method provides a parallel computation while preserving the topology by using homotopic transformations. We introduce an adapted parallelization strategy called split, distribute and merge (SDM) strategy which allows efficient parallelization of a large class of topological operators including, mainly, smoothing, skeletonization, and watershed algorithms. To achieve a good speedup, we cared about task scheduling. Distributed work during smoothing process is done by a variable number of threads. Tests on 2D binary image (512*512), using shared memory parallel machine (SMPM) with 8 CPU cores (2× Xeon E5405 running at frequency of 2 GHz), showed an enhancement of 5.2 thus a cadency of 32 images per second is achieved.
منابع مشابه
Towards a Parallel Topological Watershed: First Results
In this paper we present a parallel algorithm for the topological watershed, suitable for a shared memory parallel architecture. On a 24-core machine an average speed-up of about 11 was obtained. The method opens up possibilities for segmentation of gigapixel images such as found in remote sensing routinely.
متن کاملGigapixel-Size Real-Time Interactive Image Processing with Parallel Computers
The Parallel Computational Environment for Imaging Science, PiCEIS, is an image processing package designed for efficient execution on massively parallel computers. Through effective use of the aggregate resources of such computers, PiCEIS enables much larger and more accurate production processing using existing off the shelf hardware. Goals of PiCEIS are to decrease the difficulty of writing ...
متن کاملParallel Wavelet Transforms for Image Proccessing
Wavelet Transforms have proved to be very successful in image processing tasks such as image compression , feature detection, and ltering. This paper presents parallel algorithms for computing multi-dimensional wavelet transforms on both shared memory and distributed memory machines. Traditional data partitioning methods for n-dimensional DWTs call for data redistribution once a one dimensional...
متن کاملAn Agent-based Parallel HPSG Parser for Shared-memory Parallel Machines
We describe an agent-based parallel HPSG parser that operates on shared-memory parallel machines. It efficiently parses real-world corpora by using a wide-coverage HPSG grammar. The efficiency is due to the use of a parallel parsing algorithm and the efficient treatment of feature structures. The parsing algorithm is based on the CKY algorithm, in which resolving constraints between a mother an...
متن کاملImproving Parallel Shear-Warp Volume Rendering on Shared Address Space Multiprocessors
This paper presents a new parallel volume rendering algorithm and implementation, based on shear warp factor-ization, for shared address space multiprocessors. Starting from an existing parallel shear-warp renderer, we use increasingly detailed performance measurements on real machines and simulators to understand performance bottlenecks. This leads us to a new parallel implementation that subs...
متن کامل